The Vitali covering theorem in constructive mathematics
نویسندگان
چکیده
This paper investigates the Vitali Covering Theorem from various constructive angles. A Vitali Cover of a metric space is a cover such that for every point there exists an arbitrarily small element of the cover containing this point. The Vitali Covering Theorem now states, that for any Vitali Cover one can find a finite family of pairwise disjoint sets in the Vitali Cover that cover the entire space up to a set of a given non-zero measure. We will show, by means of a recursive counterexample, that there cannot be a fully constructive proof, but that adding a very weak semi-constructive principle suffices to give such a proof. Lastly, we will show that with an appropriate formalization in formal topology the non-constructive problems can be avoided completely. 2010 Mathematics Subject Classification 03F60, 28E99 (primary); 03F55, 06D22 (secondary)
منابع مشابه
The Vitali Covering Theorem in the Weihrauch Lattice
We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has revealed in the setting of reverse mathematics. In particular, different formulations of the Vitali Covering Theorem turn out to have different uniform computatio...
متن کاملThe starlikeness, convexity, covering theorem and extreme points of p-harmonic mappings
The main aim of this paper is to introduce three classes $H^0_{p,q}$, $H^1_{p,q}$ and $TH^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. First, we discuss the starlikeness and convexity of mappings in $H^0_{p,q}$ and $H^1_{p,q}$. Then establish the covering theorem for mappings in $H^1_{p,q}$. Finally, we determine the extreme points of the class $TH^*_{p}$.
متن کاملConstructive characterizations for packing and covering with trees
We give a constructive characterization of undirected graphs which contain k spanning trees after adding any new edge. This is a generalization of a theorem of Henneberg and Laman who gave the characterization for k = 2. We also give a constructive characterization of graphs which have k edgedisjoint spanning trees after deleting any edge of them.
متن کاملA Constructive Proof of the Heine-Borel Covering Theorem for Formal Reals
The continuum is here presented as a formal space by means of a finitary inductive definition. In this setting a constructive proof of the Heine-Borel covering theorem is given. 1 I n t r o d u c t i o n It is well known that the usual classical proofs of the Heine-Borel covering theorem are not acceptable from a constructive point of view (cf. [vS, F]). An intuitionistic alternative proof that...
متن کاملA Constructive Proof of the Heine - Borel Covering Theorem forFormal
The continuum is here presented as a formal space by means of a nitary inductive deenition. In this setting a constructive proof of the Heine-Borel covering theorem is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Logic & Analysis
دوره 4 شماره
صفحات -
تاریخ انتشار 2012